An Efficient Characterization of Complex-Balanced, Detailed-Balanced, and Weakly Reversible Systems
نویسندگان
چکیده
منابع مشابه
Finding complex balanced and detailed balanced realizations of chemical reaction networks
Reversibility, weak reversibility and deficiency, detailed and complex balancing are generally not "encoded" in the kinetic differential equations but they are realization properties that may imply local or even global asymptotic stability of the underlying reaction kinetic system when further conditions are also fulfilled. In this paper, efficient numerical procedures are given for finding com...
متن کاملNode Balanced Steady States: Unifying and Generalizing Complex and Detailed Balanced Steady States.
We introduce a unifying and generalizing framework for complex and detailed balanced steady states in chemical reaction network theory. To this end, we generalize the graph commonly used to represent a reaction network. Specifically, we introduce a graph, called a reaction graph, that has one edge for each reaction but potentially multiple nodes for each complex. A special class of steady state...
متن کاملOn Cores of Weakly Balanced Games
A new concept of balancedness for games in normal form is introduced, called weak balanacedness. It is shown that the a-core of a weakly balanced game with an infinite dimensional strategy space and without ordered preferences is nonempty. Using this result we prove core existence theorems for economies (either exchange economies of coalitional production economies) with infinitely many commodi...
متن کاملEfficient balanced codes
Ahstruct-Coding schemes in which each codeword contains equally many zeros and ones are constructed in such a way that they can be efficiently encoded and decoded. A BINARY word of length m can be called balanced if it contains exactly lm/2] ones and [m/21 zeros. Let us say that a balanced code with n information bits and p parity bits is a set of 2 " balanced binary words, each of length n + p...
متن کاملEfficient Computation of Balanced Structures
Basic graph structures such as maximal independent sets (MIS’s) have spurred much theoretical research in randomized and distributed algorithms, and have several applications in networking and distributed computing as well. However, the extant (distributed) algorithms for these problems do not necessarily guarantee fault-tolerance or load-balance properties. We propose and study “low-average de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 2020
ISSN: 0036-1399,1095-712X
DOI: 10.1137/19m1244494